Fast Simulation of Turing Machines by Random Access Machines
نویسندگان
چکیده
منابع مشابه
Deterministic Simulation of a Single Tape Turing Machine by a Random Access Machine in Sub-linear Time
Turing machines which use a single tape both for their input and as their only working space (known as 1TTMs) appear to be extremely slow for many problems compared with multi-tape Turing machines and Random Access Machines (RAMS). However, apart from a few simple problems which require quadratic time on a 1TTM but have simple linear time solutions on a multi-tape Turing machine, there have bee...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملSome Considerations on Universality
Without the investigation of the concept of universality it is quite possible that our modern computers wouldn’t exist. Although they are finite automata, at least theoretically, practically they can be treated as Turing machines processing any special program which can be seen as a special Turing machine. This paper presents some general considerations on that concept, presenting in some more ...
متن کاملRandom-Access Machines and the Extended Church-Turing Thesis
We show that a random-access machine (RAM) can simulate any effective algorithm with only constant overhead of time, thereby supporting the Extended Church-Turing Thesis.
متن کاملNearly Linear Time
The notion of linear-time computability is very sensitive to machine model. In this connection, we introduce a class NLT of functions computable in nearly linear time n(log n)O(1) on random access computers. NLT is very robust and does not depend on the particular choice of random access computers. Kolmogorov machines, Schonhage machines, random access Turing machines, etc. also compute exactl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Comput.
دوره 17 شماره
صفحات -
تاریخ انتشار 1988